Semantics vs . Syntax vs . Computations Machine Models for Type - 2 Polynomial - Time Bounded Functionals Intermediate Draft , Revision 2 + ǫ

نویسنده

  • James S. Royer
چکیده

This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook’s scheme for their basic polynomial-time functionals. We show that if P = NP, these polynomial-time effective operations are strictly more powerful on R (the class of recursive functions) than the basic feasible functions. We also consider a weaker notion of polynomial-time effective operation where the machines computing these functionals have access to the computations of their procedural parameter, but not to its program text. For this version of polynomial-time effective operations, the analog of the Kreisel-Lacombe-Shoenfield is shown to hold—their power matches that of the basic feasible functionals onR.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals

This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook’s scheme for their basic polynomial-time functionals. We show that if P = NP, these polynomial-time effective operations are...

متن کامل

Feasible functionals and intersection of ramified types

We show that the basic feasible functions of Cook and Urquhart’s BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type intersection (for tier-variants of a common type). This further confirms the stability of BFF as a notion of computational feasibility in higher type. It also suggests the potential usefulness of type-intersection restricted...

متن کامل

A New Characterization of Type-2 Feasibility

K. Mehlhorn introduced a class of polynomial time computable operators in order to study poly time reducibilities between functions. This class is deened using a generalization of A. Cobham's deenition of feasibility for type 1 functions to type 2 functionals. Cobham's feasible functions are equivalent to the familiar poly time functions. We generalize this equivalence to type 2 functionals. Th...

متن کامل

A Quantum Time-Space Lower Bound for the Counting Hierarchy

We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are complete problems for the first and second levels of the counting hierarchy, respectively. We prove that for every real d and every positive real ǫ there exists a real c > 1 such that either: • MajMajSAT does not have a qua...

متن کامل

Separating Notions of Higher-Type Polynomial-Time

In his paper on machine characterizations of feasible functionals at all simple types, Seth [Set95] introduced the higher-type complexity class D and conjectured that this class is strictly larger than BFF, the basic feasible functionals of Cook and Urquhart [CU93]. In this paper we clarify the nature of D by characterizing D−, a subclass of D, through a typed programming formalism and show D− ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997